A Monadic Interpretation of Tactics
نویسندگان
چکیده
Many proof tools use ‘tactic languages’ as programs to direct their proofs. We present a simplified idealised tactic language, and describe its denotational semantics. The language has many applications outside theorem-proving activities. The semantics is parametrised by a monad (plus additional structure). By instantiating this in various ways, the core semantics of a number of different tactic languages is obtained.
منابع مشابه
Finite variability interpretation of monadic logic of order
We consider an interpretation of monadic second-order logic of order in the continuous time structure of finitely variable signals. We provide a characterization of the expressive power of monadic logic. As a by-product of our characterization we show that many fundamental theorems which hold in the discrete time interpretation of monadic logic are still valid in the continuous time interpretat...
متن کاملPeano Arithmetic May Not Be Interpretable in the Monadic Theory of Order
Gurevich and Shelah have shown that Peano Arithmetic cannot be interpreted in the monadic second-order theory of short chains (hence, in the monadic secondorder theory of the real line). We will show here that it is consistent that there is no interpretation even in the monadic second-order theory of all chains.
متن کاملOn the Decidability of Continuous Time Speci cationFormalismsA
We consider an interpretation of monadic second-order logic of order in the continuous time structure of nitely variable signals and show the decidability of monadic logic in this structure. The expressive power of monadic logic is illustrated by providing a straightforward meaning preserving translation into monadic logic of three typical continuous time speciication formalism: Temporal Logic ...
متن کاملRandom graphs in the monadic theory of order
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the monadic theory of all chains. It is provable from ZFC that the theory of random graphs is not interpretable in the monadic second order theory of short chains (hence, in the monadic theory of the real line). We are intere...
متن کاملMtac: A Monad for Typed Tactic Programming in Coq Reference Manual
Effective support for custom proof automation is essential for largescale interactive proof development. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on advanced type-theoretic machinery that is not easily integrated into established theorem provers. We pr...
متن کامل